Adaptive stripe based patch matching for depth estimation
نویسندگان
چکیده
In this contribution a novel stereo matching technique for depth estimation in stereoscopic image pairs is pre sented The input image pair is preprocessed in the in tensity domain and edge maps together with an adap tive mesh approximating to linearly modeled regions are obtained Then an iterative stripe based quadri lateral patch matching technique is employed to esti mate the depth map from the image pair in a hierarchi cal manner Finally the resultant map is postprocessed to smooth the depth map at the patch borders The quality of test results demonstrate the e ectiveness of the technique
منابع مشابه
Stripe mesh based disparity estimation by using 3-D Hough transform
This correspondence presents a novel matching technique for disparity estimation. The technique combines advantages of an adaptive stripe-based mesh structure and Hough transform. First, a mesh that is composed of triangular patches and ts to the depth changes is generated by using edge maps. In each patch, depth of the scene is approximated by a surface. A search space is built by di erence ma...
متن کاملDepth Estimation for Lytro Images by Adaptive Window Matching on EPI
A depth estimation algorithm from plenoptic images is presented. There are two stages to estimate the depth. First is the initial estimation base on the epipolar plane images (EPIs). Second is the refinement of the estimations. At the initial estimation, adaptive window matching is used to improve the robustness. The size of the matching window is based on the texture description of the sample ...
متن کاملNew adaptive interpolation schemes for efficient meshbased motion estimation
Motion estimation and compensation is an essential part of existing video coding systems. The mesh-based motion estimation (MME) produces smoother motion field, better subjective quality (free from blocking artifacts), and higher peak signal-to-noise ratio (PSNR) in many cases, especially at low bitrate video communications, compared to the conventional block matching algorithm (BMA). Howev...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملStochastic Optimization Based 3D Dense Reconstruction from Multiple Views with High Accuracy and Completeness
This paper presents a stochastic optimization based 3D dense reconstruction from multiple views. Accuracy and completeness are two major measure indices for performance evaluation of various multi-view stereo (MVS) algorithms. First, the reconstruction accuracy is highly related to the stereo mismatches over the multiple views. Stereo mismatches occur in the image regions involving the lack of ...
متن کامل